Heteroscedasticity testing after outlier removal

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering with Outlier Removal

Cluster analysis and outlier detection are strongly coupled tasks in data mining area. Cluster structure can be easily destroyed by few outliers; on the contrary, the outliers are defined by the concept of cluster, which are recognized as the points belonging to none of the clusters. However, most existing studies handle them separately. In light of this, we consider the joint cluster analysis ...

متن کامل

Algorithms for optimal outlier removal

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c, all our algorithms run in O(n log n) time.

متن کامل

Biochemical Testing After Pheochromocytoma Removal: How Early?

Pheochromocytomas are catecholamine-producing tumors with typical clinical presentation. Tumor resection is considered as an appropriate treatment strategy. Due to its unpredictable clinical behavior, biochemical testing is mandatory to confirm the success of tumor removal after surgery. The aim of the study was to investigate the feasibility of a shorter interval of postoperative testing (earl...

متن کامل

Optimal outlier removal in high-dimensional spaces

We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined to be a β-outlier if there exists some direction w in which its squared distance from the mean along w is greater than β times the average squared distance from the mean along w. Our main theorem is that for any ǫ > 0, ...

متن کامل

Outlier Removal in 2D Leap Frog Algorithm

In this paper a 2D Leap Frog Algorithm is applied to solve the so-called noisy Photometric Stereo problem. In 3-source Photometric Stereo (noiseless or noisy) an ideal unknown Lambertian surface is illuminated from distant light-source directions (their directions are assumed to be linearly independent). The subsequent goal, given three images is to reconstruct the illuminated object’s shape. U...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Econometric Reviews

سال: 2020

ISSN: 0747-4938,1532-4168

DOI: 10.1080/07474938.2020.1735749